Achtung:

Sie haben Javascript deaktiviert!
Sie haben versucht eine Funktion zu nutzen, die nur mit Javascript möglich ist. Um sämtliche Funktionalitäten unserer Internetseite zu nutzen, aktivieren Sie bitte Javascript in Ihrem Browser.

Zeitschriftenbeiträge

Wojciech Czerwiński and Wim Martens and Lorijn van Rooijen and Marc Zeitoun and Georg Zetzsche: A Characterization for Decidable Separability by Piecewise Testable Languages. In Discrete Mathematics and Theoretical Computer Science, vol. 19, no. 4 (2017)
Show Bibtex | URL | DOI

@article{CMv+2017, author = {Wojciech Czerwiński and Wim Martens and Lorijn van Rooijen and Marc Zeitoun and Georg Zetzsche}, title = {A Characterization for Decidable Separability by Piecewise Testable Languages}, journal = {Discrete Mathematics and Theoretical Computer Science}, year = {2017}, volume = {19}, number = {4} }

Thomas Place and Lorijn van Rooijen and Marc Zeitoun: On Separation by Locally Testable and Locally Threshold Testable Languages. In Logical Methods in Computer Science, vol. 10, no. 3 (2014)
Show Bibtex | URL | DOI

@article{MR3263876, author = {Thomas Place and Lorijn van Rooijen and Marc Zeitoun}, title = {On Separation by Locally Testable and Locally Threshold Testable Languages}, journal = {Logical Methods in Computer Science}, year = {2014}, volume = {10}, number = {3} }

Dion Coumans and Mai Gehrke and Lorijn van Rooijen: Relational Semantics for Full Linear Logic. In Journal of Applied Logic, vol. 12, no. 1, pp. 50--66 (2014)
Show Bibtex | URL | DOI

@article{MR3166197, author = {Dion Coumans and Mai Gehrke and Lorijn van Rooijen}, title = {Relational Semantics for Full Linear Logic}, journal = {Journal of Applied Logic}, year = {2014}, volume = {12}, number = {1}, pages = {50--66} }

Anna Chernilovskaya and Mai Gehrke and Lorijn van Rooijen: Generalized Kripke Semantics for the Lambek-Grishin Calculus. In Logic Journal of the IGPL, vol. 20, no. 6, pp. 1110--1132 (2012)
Show Bibtex | URL | DOI

@article{MR2999226, author = {Anna Chernilovskaya and Mai Gehrke and Lorijn van Rooijen}, title = {Generalized Kripke Semantics for the Lambek-Grishin Calculus}, journal = {Logic Journal of the IGPL}, year = {2012}, volume = {20}, number = {6}, pages = {1110--1132} }

Rezensierte Konferenzbeiträge

Lorijn van Rooijen and Frederik Simon Bäumer and Marie Christin Platenius and Michaela Geierhos and Heiko Hamann and Gregor Engels: From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In Fourth International Workshop on Artificial Intelligence for Requirements Engineering (AIRE'17). , pp. 379-385 (2017)
Show Bibtex

@inproceedings{vBP+2017, author = {Lorijn van Rooijen and Frederik Simon Bäumer and Marie Christin Platenius and Michaela Geierhos and Heiko Hamann and Gregor Engels}, title = {From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}, booktitle = {Fourth International Workshop on Artificial Intelligence for Requirements Engineering (AIRE'17)}, year = {2017}, pages = {379-385} }

Marcel Wever and Lorijn van Rooijen and Heiko Hamann: Active Coevolutionary Learning of Requirements Specifications from Examples. In Genetic and Evolutionary Computation Conference (GECCO). , pp. 1327-1334 (2017) Best Paper Award.
Show Bibtex

@inproceedings{WvH2017, author = {Marcel Wever and Lorijn van Rooijen and Heiko Hamann}, title = {Active Coevolutionary Learning of Requirements Specifications from Examples}, booktitle = {Genetic and Evolutionary Computation Conference (GECCO)}, year = {2017}, pages = {1327-1334}, note = {Best Paper Award.} }

Lorijn van Rooijen and Heiko Hamann: Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm. In Third International Workshop on Artificial Intelligence for Requirements Engineering (AIRE'16). (2016)
Show Bibtex

@inproceedings{vH2016, author = {Lorijn van Rooijen and Heiko Hamann}, title = {Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm}, booktitle = {Third International Workshop on Artificial Intelligence for Requirements Engineering (AIRE'16)}, year = {2016} }

Wojciech Czerwinski and Wim Martens and Lorijn van Rooijen and Marc Zeitoun: A Note on Decidable Separability by Piecewise Testable Languages. In Fundamentals of Computation Theory - 20th International Symposium. Springer, Lecture Notes in Computer Science, vol. 9210, pp. 173--185 (2015)
Show Bibtex | URL | DOI

@inproceedings{DBLP:conf/fct/CzerwinskiMRZ15, author = {Wojciech Czerwinski and Wim Martens and Lorijn van Rooijen and Marc Zeitoun}, title = {A Note on Decidable Separability by Piecewise Testable Languages}, booktitle = {Fundamentals of Computation Theory - 20th International Symposium}, year = {2015}, volume = {9210}, series = {Lecture Notes in Computer Science}, pages = {173--185}, publisher = {Springer} }

Thomas Place and Lorijn van Rooijen and Marc Zeitoun: Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In Mathematical foundations of computer science 2013. Springer, Heidelberg, Lecture Notes in Computer Science, vol. 8087, pp. 729--740 (2013)
Show Bibtex | URL | DOI

@inproceedings{DBLP:conf/mfcs/PlaceRZ13, author = {Thomas Place and Lorijn van Rooijen and Marc Zeitoun}, title = {Separating Regular Languages by Piecewise Testable and Unambiguous Languages}, booktitle = {Mathematical foundations of computer science 2013}, year = {2013}, volume = {8087}, series = {Lecture Notes in Computer Science}, pages = {729--740}, publisher = {Springer, Heidelberg} }

Thomas Place and Lorijn van Rooijen and Marc Zeitoun: Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. In 33nd International Conference on Foundations of Software Technology and Theoretical Computer Science. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, LIPIcs, vol. 24, pp. 363--375 (2013)
Show Bibtex | URL | DOI

@inproceedings{DBLP:conf/fsttcs/PlaceRZ13, author = {Thomas Place and Lorijn van Rooijen and Marc Zeitoun}, title = {Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages}, booktitle = {33nd International Conference on Foundations of Software Technology and Theoretical Computer Science}, year = {2013}, volume = {24}, series = {LIPIcs}, pages = {363--375}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik} }

Dissertationen

Lorijn van Rooijen: A Combinatorial Approach to the Separation Problem for Regular Languages. Type: Phd Thesis, Université de Bordeaux (2014)
Show Bibtex | Show Abstract | URL

@phdthesis{vRooijenPhD, author = {Lorijn van Rooijen}, title = {A Combinatorial Approach to the Separation Problem for Regular Languages}, school = {Université de Bordeaux}, year = {2014} }

The separation problem, for a class S of languages, is the following: given two input languages, does there exist a language in S that contains the first language and that is disjoint from the second language? For regular input languages, the separation problem for a class S subsumes the classical membership problem for this class, and provides more detailed information about the class. This separation problem first emerged in an algebraic context in the form of pointlike sets, and in a profinite context as a topological separation problem. These problems have been studied for specific classes of languages, using involved techniques from the theory of profinite semigroups. In this thesis, we are not only interested in showing the decidability of the separation problem for several subclasses of the regular languages, but also in constructing a separating language, if it exists, and in the complexity of these problems. We provide a generic approach, based on combinatorial arguments, to proving the decidability of this problem for a given class. Using this approach, we prove that the separation problem is decidable for the classes of piecewise testable languages, unambiguous languages, and locally (threshold) testable languages. These classes are defined by different fragments of first-order logic, and are among the most studied classes of regular languages. Furthermore, our approach yields a description of a separating language, in case it exists.

Masterarbeiten

Lorijn van Rooijen: Generalised Kripke Semantics for Various Substructural Logics. Type: Master Thesis, Radboud Universiteit Nijmegen (2011)
Show Bibtex | URL

@mastersthesis{vRooijenMSc, author = {Lorijn van Rooijen}, title = {Generalised Kripke Semantics for Various Substructural Logics}, school = {Radboud Universiteit Nijmegen}, year = {2011} }